Asymptotic Size Ramsey Results for Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Asymptotic Size Ramsey Results for Bipartite Graphs
We show that limn→∞ r̂(F1,n, . . . , Fq,n, Fp+1, . . . , Fr)/n exists, where the bipartite graphs Fq+1, . . . , Fr do not depend on n while, for 1 ≤ i ≤ q, Fi,n is obtained from some bipartite graph Fi with parts V1 ∪ V2 = V (Fi) by duplicating each vertex v ∈ V2 (cv + o(1))n times for some real cv > 0. In fact, the limit is the minimum of a certain mixed integer program. Using the Farkas Lemma ...
متن کاملDensity theorems for bipartite graphs and related Ramsey-type results
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve and generalize earlier results of various researchers. The proofs combine probabilistic arguments with some combinatorial ideas. In addition, these techniqu...
متن کاملAsymptotic Bounds for Bipartite Ramsey Numbers
The bipartite Ramsey number b(m,n) is the smallest positive integer r such that every (red, green) coloring of the edges of Kr,r contains either a red Km,m or a green Kn,n. We obtain asymptotic bounds for b(m, n) for m ≥ 2 fixed and n →∞.
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملOn Bipartite Graphs with Linear Ramsey Numbers
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most ∆ is less than 8(8∆)|V (H)|. This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all ∆≥1 and n≥∆+1 there exists a bipartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2002
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480101384086